Search results for "finite field"

showing 10 items of 15 documents

Automorphisms of hyperelliptic GAG-codes

2009

Abstract We determine the n –automorphism group of generalized algebraic-geometry codes associated with rational, elliptic and hyperelliptic function fields. Such group is, up to isomorphism, a subgroup of the automorphism group of the underlying function field.

Abelian varietyDiscrete mathematicsautomorphismsGroup (mathematics)Applied Mathematicsgeneralized algebraic geometry codes.Outer automorphism groupReductive groupAutomorphismTheoretical Computer ScienceCombinatoricsMathematics::Group Theorygeometric Goppa codeAlgebraic groupDiscrete Mathematics and Combinatoricsalgebraic function fieldsSettore MAT/03 - GeometriaIsomorphismfinite fieldsGeometric Goppa codesfinite fieldalgebraic function fieldHyperelliptic curvegeneralized algebraic-geometry codesMathematicsDiscrete Mathematics
researchProduct

ON AUTOMORPHISMS OF GENERALIZED ALGEBRAIC-GEOMETRY CODES.

2007

Abstract We consider a class of generalized algebraic-geometry codes based on places of the same degree of a fixed algebraic function field over a finite field F / F q . We study automorphisms of such codes which are associated with automorphisms of F / F q .

Algebraic function fieldDiscrete mathematicsAlgebraic cycleFinite fieldFunction field of an algebraic varietyAlgebra and Number TheoryAutomorphisms of the symmetric and alternating groupsAlgebraic extensionAlgebraic geometryAutomorphismMathematics
researchProduct

On the subset sum problem for finite fields

2021

Abstract Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solutions of the subset sum problem over G, by giving an explicit formula for the number of subsets of G of prescribed size whose elements sum up to a given element of G. They also determined a closed-form expression for the case where the subsets are required to contain only nonzero elements. In this paper we give an alternative proof of the two formulas. Our argument is purely combinatorial, as in the original proof by Li and Wan, but follows a different and somehow more “natural” approach. We also indicate some new connections with coding theory and combinatorial designs.

Discrete mathematicsAlgebra and Number TheoryApplied MathematicsGeneral EngineeringSubset sumFinite fieldCoding theoryExpression (computer science)Zero-sum setTheoretical Computer ScienceFinite fieldCombinatorial designSettore MAT/05 - Analisi MatematicaSubset sum problemSettore MAT/03 - GeometriaElement (category theory)Argument (linguistics)Subset sum problemZero sumsetAdditive groupMathematics
researchProduct

Point counting on Picard curves in large characteristic

2005

We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field Fp, the algorithm has complexity O(p).

Discrete mathematicsAlgebra and Number TheoryApplied MathematicsJacobian varietyGeometryField (mathematics)Computational Mathematicssymbols.namesakeMathematics::Algebraic GeometryFinite fieldPoint countingCardinalityJacobian matrix and determinantsymbolsPicard hornPrime fieldMathematicsMathematics of Computation
researchProduct

Prime Rings Whose Units Satisfy a Group Identity. II

2003

Abstract Let R be a prime ring and 𝒰(R) its group of units. We prove that if 𝒰(R) satisfies a group identity and 𝒰(R) generates R,then either R is a domain or R is isomorphic to the algebra of n × n matrices over a finite field of order d. Moreover the integers n and d depend only on the group identity satisfed by 𝒰(R). This result has been recently proved by C. H. Liu and T. K. Lee (Liu,C. H.; Lee,T. K. Group identities and prime rings generated by units. Comm. Algebra (to appear)) and here we present a new different proof.

Discrete mathematicsAssociated primeAlgebra and Number TheoryFinite fieldGroup (mathematics)Prime ringA domainOrder (group theory)SubringPrime (order theory)MathematicsCommunications in Algebra
researchProduct

A computational criterion for the Kac conjecture

2006

Abstract We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root multiplicity of the associated Kac–Moody algebra. Our criterion suits very well for computer tests.

Discrete mathematicsPure mathematicsAlgebra and Number TheoryConjectureQuiverMultiplicity (mathematics)16G20High Energy Physics::TheoryFinite fieldMathematics::Quantum AlgebraFOS: MathematicsRepresentation Theory (math.RT)Mathematics::Representation TheoryIndecomposable moduleMathematics - Representation TheoryMathematicsJournal of Algebra
researchProduct

Computing generators of the tame kernel of a global function field

2006

Abstract The group K 2 of a curve C over a finite field is equal to the tame kernel of the corresponding function field. We describe two algorithms for computing generators of the tame kernel of a global function field. The first algorithm uses the transfer map and the fact that the l -torsion can easily be described if the ground field contains the l th roots of unity. The second method is inspired by an algorithm of Belabas and Gangl for computing generators of K 2 of the ring of integers in a number field. We finally give the generators of the tame kernel for some elliptic function fields.

Discrete mathematicsPure mathematicsAlgebra and Number TheoryGlobal function fieldsRoot of unityElliptic functionAlgebraic number fieldK-theoryRing of integersAlgorithmic number theoryGround fieldComputational MathematicsFinite fieldTorsion (algebra)Function fieldMathematicsJournal of Symbolic Computation
researchProduct

A novel approach to integration by parts reduction

2015

Integration by parts reduction is a standard component of most modern multi-loop calculations in quantum field theory. We present a novel strategy constructed to overcome the limitations of currently available reduction programs based on Laporta's algorithm. The key idea is to construct algebraic identities from numerical samples obtained from reductions over finite fields. We expect the method to be highly amenable to parallelization, show a low memory footprint during the reduction step, and allow for significantly better run-times.

FOS: Computer and information sciencesComputer Science - Symbolic ComputationHigh Energy Physics - TheoryPhysicsNuclear and High Energy Physics010308 nuclear & particles physicsFOS: Physical sciencesConstruct (python library)Symbolic Computation (cs.SC)01 natural scienceslcsh:QC1-999Computational scienceReduction (complexity)High Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)Finite fieldHigh Energy Physics - Theory (hep-th)Component (UML)0103 physical sciencesKey (cryptography)Memory footprintIntegration by partsAlgebraic number010306 general physicslcsh:PhysicsPhysics Letters B
researchProduct

Integral Reduction with Kira 2.0 and Finite Field Methods

2021

We present the new version 2.0 of the Feynman integral reduction program Kira and describe the new features. The primary new feature is the reconstruction of the final coefficients in integration-by-parts reductions by means of finite field methods with the help of FireFly. This procedure can be parallelized on computer clusters with MPI. Furthermore, the support for user-provided systems of equations has been significantly improved. This mode provides the flexibility to integrate Kira into projects that employ specialized reduction formulas, direct reduction of amplitudes, or to problems involving linear system of equations not limited to relations among standard Feynman integrals. We show…

High Energy Physics - TheoryComputer scienceLinear systemGeneral Physics and AstronomyFOS: Physical sciencesRational functionSystem of linear equationsSymbolic computation01 natural sciences010305 fluids & plasmasAlgebraHigh Energy Physics - PhenomenologyFinite fieldHigh Energy Physics - Phenomenology (hep-ph)High Energy Physics - Theory (hep-th)Hardware and Architecture0103 physical sciencesIntegration by partsLinear independenceIntegration by reduction formulae010306 general physics
researchProduct

Star-group identities and groups of units

2010

Analogous to *-identities in rings with involution we define *-identities in groups. Suppose that G is a torsion group with involution * and that F is an infinite field with char F ≠ 2. Extend * linearly to FG. We prove that the unit group \({\mathcal{U}}\) of FG satisfies a *-identity if and only if the symmetric elements \({\mathcal{U}^+}\) satisfy a group identity.

Involution (mathematics)AlgebraCombinatoricsUnit groupInfinite fieldgroup identityGeneral MathematicsTorsion (algebra)involutionANÉIS E ÁLGEBRAS ASSOCIATIVOSMathematics
researchProduct